Point set operators and their interrelations
نویسندگان
چکیده
منابع مشابه
Random Fixed Point Theorems for Asymptotic 1-set Contraction Operators
Random fixed point theorems for condensing 1-set contraction selfmaps are known. But no random fixed point theorem for more general asymptotic 1-set contraction selfmaps is yet available. The purpose of this paper is to prove random fixed point theorems for such maps. 1. Introduction. Random fixed point theorems are stochastic versions of (classical or deterministic) fixed point theorems and ar...
متن کاملTeaching the Chief Information Officers: An Assessment of the Interrelations within their Skill Set
Due to the high volatility in the field of information technology (IT) and the rapid technological advancements, all IT professionals constantly have to be able to evaluate trends and put them into context. This is especially true for those who fulfill the role of a company’s chief information officer (CIO). But if there is a gap between the required set of skills and those needed, training bec...
متن کاملwavelets, modulation spaces and pseudidifferential operators
مبحث تحلیل زمان-فرکانسی سیگنالها یکی از مهمترین زمینه های مورد بررسی پژوهشگران علوم ÷ایه کاربردی و فنی مهندسی میباشد.در این پایان نامه فضاهای مدولاسیون به عنوان زمینه اصلی این بررسی ها معرفی گردیده اند و نتایج جدیدی که در حوزه های مختلف ریاضی،فیزیک و مهندسی کاربرداساسی و فراوانی دارند استوار و بیان شده اند.به ویژه در این پایان نامه به بررسی و یافتن مقادیر ویژه عملگر های شبه دیفرانسیل با سمبل در...
Set Quantities and Tauberian Operators
The concept of convexity plays an important role in the classical geometry of normed spaces and it is frequently used in several branches of nonlinear analysis. In recent years some papers that contain generalizations of the concept of convexity with the help of the measures of noncompactness have appeared. The Tauberian operators were introduced by Kalton and Wilansky (1976) and they appear in...
متن کاملGraph Polynomials and Their Applications II: Interrelations and Interpretations
A graph polynomial is an algebraic object associated with a graph that is usually invariant at least under graph isomorphism. As such, it encodes information about the graph, and enables algebraic methods for extracting this information. This chapter surveys a comprehensive, although not exhaustive, sampling of graph polynomials. It concludes Graph Polynomials and their Applications I: The Tutt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1939
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1939-07078-x